Continuous Selections and Approximations in Α-convex Metric Spaces
نویسنده
چکیده
In the paper, the notion of a generalized convexity was defined and studied from the view-point of the selection and approximation theory of set-valued maps. We study the simultaneous existence of continuous relative selections and graph-approximations of lower semicontinuous and upper semicontinuous set-valued maps with α-convex values having nonempty intersection.
منابع مشابه
Iterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملNew best proximity point results in G-metric space
Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملCoincidence Quasi-Best Proximity Points for Quasi-Cyclic-Noncyclic Mappings in Convex Metric Spaces
We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...
متن کامل